A Column Generation Procedure for the Split Delivery Vehicle Routing Problem Using a Route-Based Formulation
نویسندگان
چکیده
The Split Delivery Vehicle Routing Problem (SDVRP) allows customers to be assigned to multiple routes. A column generation procedure using a route-based formulation is developed for the SDVRP and computational results are given for thirty-two data sets from previous literature. The SDVRP route-based formulation appears tighter (stronger) linear relaxation than a comparable SDVRP flow formulation. With respect to the total travel distance and computer time, the column generation procedure compares favorably versus previously published methods. The result is important for real-world since both the tractability and solution quality of larger (e.g., many vehicle routes, many customers) problems are both key issues when making vehicle routing decisions. The column generation method, along with the route-based formulation, provides an improved solution procedure that would be more appropriate for real-world problems than the previously published methods. A Column Generation Procedure for the Split Delivery Vehicle Routing Problem Using a Route-Based Formulation
منابع مشابه
A Column Generation Procedure for the Split Delivery Vehicle Routing Problem Using a Route-Based Formulation
The Split Delivery Vehicle Routing Problem (SDVRP) allows customers to be assigned to multiple routes. A column generation procedure using a route-based formulation is developed for the SDVRP and computational results are given for thirty-two data sets from previous literature. The SDVRP route-based formulation appears tighter (stronger) linear relaxation than a comparable SDVRP flow formulatio...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملFuzzy Vehicle Routing Problem with Split Delivery: Trade-off between Air Pollution and Customer Satisfaction
In large-scale emergency, the vehicle routing problem focuses on finding the best routes for vehicles. The equitable distribution has a vital role in this problem to decrease the number of death and save people's lives. In addition to this, air pollution is a threat to people’s life and it can be considered to omit other kinds of disasters happens because of it. So, a new MINLP model presented ...
متن کاملNew Lower Bounds for the Split Delivery Vehicle Routing Problem
This paper presents an algorithm to obtain lower bounds for the Split Delivery Vehicle Routing Problem. An extended formulation over a large set of variables is provided and valid inequalities are identified. The algorithm combines column and cut generation and was able to improve the lower bound for almost all instances tested.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJORIS
دوره 5 شماره
صفحات -
تاریخ انتشار 2014